Parallel Independence in Attributed Graph Rewriting

Parallel Admissible Graph Rewriting

We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in general whereas it is confluent in the case of weakly orthogonal term rewriting systems. We show, however, that the considered relation is always confluent, as well as confluent modulo bisimilarity, for a large class of g...

Parallel Graph Rewriting Systems

Term Graph Rewriting and Parallel Term Rewriting

The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing. It is also known that if term graphs are allowed to contain cycles, then one term graph reduction may correspond to infinitely many term reductions. We stress that this fact can be interpreted in two ways. According to the ...

Modelling Constrained Dynamic Software Architecture with Attributed Graph Rewriting Systems

Dynamic software architectures are studied for handling adaptation in distributed systems, coping with new requirements, new environments, and failures. Graph rewriting systems have shown their appropriateness to model such architectures, particularly while considering the consistency of theirs reconfigurations. They provide generic formal means to specify structural properties, but imply a poo...

Parallel Independence in Hierarchical Graph Transformation

Hierarchical graph transformation as defined in [1, 2] extends double-pushout graph transformation in the spirit of term rewriting: Graphs are provided with hierarchical structure, and transformation rules are equipped with graph variables. In this paper we analyze conditions under which diverging transformation steps H ⇐ G ⇒ H ′ can be joined by subsequent transformation sequences H ∗ ⇒ M ∗ ⇐ ...